skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Xu, Weikun"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. This work aims to jointly estimate the arrival rate of customers to a market and the nested logit model that forecasts hierarchical customer choices from an assortment of products. The estimation is based on censored transactional data, where lost sales are not recorded. The goal is to determine the arrival rate, customer taste coefficients, and nest dissimilarity parameters that maximize the likelihood of the observed data. The problem is formulated as a maximum likelihood estimation model that addresses two prevailing challenges in the existing literature: Estimating demand fromdata with unobservable lost salesand capturingcustomer taste heterogeneity arising from hierarchical choices. However, the model is intractable to solve or analyze due to the nonconcavity of the likelihood function in both taste coefficients and dissimilarity parameters. We characterize conditions under which the model parameters are identifiable. Our results reveal that the parameter identification is influenced by thediversity of products and nests. We also develop a sequential minorization-maximization algorithm to solve the problem, by which the problem boils down to solving a series of convex optimization models with simple structures. Then, we show the convergence of the algorithm by leveraging the structural properties of these models. We evaluate the performance of the algorithm by comparing it with widely used benchmarks, using both synthetic and real data. Our findings show that the algorithm consistently outperforms the benchmarks in maximizing in-sample likelihood and ranks among the top two in out-of-sample prediction accuracy. Moreover, our algorithm is particularly effective in estimating nested logit models with low dissimilarity parameters, yielding higher profitability compared to the benchmarks. 
    more » « less
    Free, publicly-accessible full text available March 13, 2026